The Fault-Tolerant Facility Location Problem with Submodular Penalties
نویسندگان
چکیده
In this paper, we consider the fault-tolerant facility location problem with submodular penalties that is a common generalization of the fault-tolerant facility location problem and the facility location problem with submodular penalties. For this problem, we present a combinatorial 3 ·HR-approximation algorithm, where R is the maximum connectivity requirement and HR is the R-th harmonic number. Our algorithm is a common generalization of the algorithm for the the fault-tolerant facility location problem presented by Jain and Vazirani (2003) and that for the facility location problem with submodular penalties presented by Du, Lu and Xu (2012).
منابع مشابه
An Approximation Algorithm For The Stochastic Fault-tolerant Facility Location Problem
In this paper, we study a stochastic version of the fault-tolerant facility location problem. By exploiting the stochastic structure, we propose a 5-approximation algorithm which uses the LProunding technique based on the revised optimal solution to the linear programming relaxation of the stochastic fault-tolerant facility location problem.
متن کاملDistributed Approximation Algorithms for Facility Location Problems
In this paper, some distributed approximation algorithms for uncapacitated facility location problem and fault-tolerant facility location problem are summarized, respectively. The worst-case run time of the distributed version of the uncapacitated facility location problem is ( ) O n , where n is the number of network nodes. In addition, the approximation approach for the fault-tolerant facilit...
متن کاملOn Fault-Tolerant Facility Location
We give a new LP-rounding 1.724-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Shmoys & Swamy. Our work applies a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for Uncapacitated ...
متن کاملGroup-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
In the context of general demand cost sharing, we present the first group-strategyproof mechanisms for the metric fault tolerant uncapacitated facility location problem. They are (3L)-budget-balanced and (3L · (1 +Hn))-efficient, where L is the maximum service level and n is the number of agents. These mechanisms generalize the seminal Moulin mechanisms for binary demand. We also apply this app...
متن کاملRobust Fault Tolerant Uncapacitated Facility Location
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities. This paper concerns the robust fault-tolerant version of the uncapacitated facility location problem (RFTFL). In this pr...
متن کامل